A Lower Bound on the Sinc Function and Its Application
نویسندگان
چکیده
A lower bound on the sinc function is given. Application for the sequence {b(n)}(n=1)(∞) which related to Carleman inequality is given as well.
منابع مشابه
A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملSolution of Troesch's problem through double exponential Sinc-Galerkin method
Sinc-Galerkin method based upon double exponential transformation for solving Troesch's problem was given in this study. Properties of the Sinc-Galerkin approach were utilized to reduce the solution of nonlinear two-point boundary value problem to same nonlinear algebraic equations, also, the matrix form of the nonlinear algebraic equations was obtained.The error bound of the method was found. ...
متن کاملAPPLICATION OF THE SINC APPROXIMATION TO THE SOLUTION OF BRATU'S PROBLEM
In this work, we study the performance of the sinc-Collocation method for solving Bratu's problem. For different choices of step size, we consider the maximum absolute errors in the solutions at sinc grid points and tabulated in tables. The comparison of the obtained results veri ed that this method converges to the exact solution rapidly and with
متن کاملThe Structure of Bhattacharyya Matrix in Natural Exponential Family and Its Role in Approximating the Variance of a Statistics
In most situations the best estimator of a function of the parameter exists, but sometimes it has a complex form and we cannot compute its variance explicitly. Therefore, a lower bound for the variance of an estimator is one of the fundamentals in the estimation theory, because it gives us an idea about the accuracy of an estimator. It is well-known in statistical inference that the Cram&eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014